Edge fault tolerance of super edge connectivity for three families of interconnection networks

Let G = (V,E) be a connected graph. G is said to be super edge connected (or super-k for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-k if for any edge set S # E(G) with jSj 6m, G S is still super-k. The maximum cardinality of m-super-k is called the edge fault tolerance of super edge connectivity of G. In this paper, we discuss the edge fault tolerance of super edge connectivity of three families of interconnection networks. 2011 Elsevier Inc. All rights reserved.